Controlling quantum random walk with a step-dependent coin
نویسندگان
چکیده
منابع مشابه
Quantum Walk with a time-dependent coin
We introduce quantum walks with a time-dependent coin, and show how they include, as a particular case, the generalized quantum walk recently studied by Wojcik et al. [Phys. Rev. Lett. 93, 180601(2004)] which exhibits interesting dynamical localization and quasiperiodic dynamics. Our proposal allows for a much easier implementation of this particular rich dynamics than the original one. Moreove...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملDiscrete-time quantum walk with feed-forward quantum coin
Constructing a discrete model like a cellular automaton is a powerful method for understanding various dynamical systems. However, the relationship between the discrete model and its continuous analogue is, in general, nontrivial. As a quantum-mechanical cellular automaton, a discrete-time quantum walk is defined to include various quantum dynamical behavior. Here we generalize a discrete-time ...
متن کاملQuantum Random Walk via Classical Random Walk With Internal States
In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role in many hugely successful randomized algorithms. In this paper we introduce a new ...
متن کاملAsymptotic analysis of a random walk with a history-dependent step length.
We study an unbiased, discrete-time random walk on the nonnegative integers, with the origin absorbing, and a history-dependent step length. Letting y denote the maximum distance the walker has ever been from the origin, steps that do not change y have length v, while those that increase y (taking the walker to a site that has never been visited) have length n. The process serves as a simplifie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2018
ISSN: 1367-2630
DOI: 10.1088/1367-2630/aad899